Equitable specialized block-colourings for 4-cycle systems—I
نویسندگان
چکیده
منابع مشابه
Equitable block colourings for 8-cycle systems
Let Σ = (X,B) be an 8-cycle system of order v = 1+16k. A c-colouring of type s is a map φ : B → C, with C set of colours, so that exactly c colours are used and for every vertex x all the blocks containing x are coloured with exactly s colours. Let 8k = qs+ r, with q, r ≥ 0. The colouring φ is called equitable if for every vertex x the set of the 8k blocks containing x is partitioned into r col...
متن کاملEquitable Block Colourings for Systems of 4-Kites
An equitable colouring of a balanced G-design (X,B) is a map φ∶B → C such that ∣bi(x) − bj(x)∣ ≤ 1 for any x ∈ X and i, j, with i ≠ j, being bi(x) the number of blocks containing the vertex x and coloured with the colour i. A c-colouring is a colouring in which exactly c colours are used. A c-colouring of type s is a colourings in which, for every vertex x, all the blocks containing x are colou...
متن کاملEquitable Tricolourings for 4-Cycle Systems
Let Σ = (X,B) a 4-cycle system of order v = 1 + 8k. A c-colouring of type s is a map φ∶B → C, with C set of colours, such that exactly c colours are used and for every vertex x all the blocks containing x are coloured exactly with s colours. Let 4k = qs + r, with q, r ≥ 0. φ is equitable if for every vertex x the set of the 4k blocks containing x is parted in r colour classes of cardinality q +...
متن کاملEquitable colourings in the Witt designs
There is a vast literature already in existence on colourings in graphs and designs. We refer the interested reader to [2, 7, 8, 11, 12]. A major application of such colourings is to sampling and scheduling problems. For an excellent consideration of designs for statistical purposes, see [13]; in [8], examples of graph colouring applications in scheduling are described. Let P be a point set and...
متن کاملEquitable Colourings Of D-Degenerate Graphs
In many applications of graph colouring the sizes of colour classes should not be too large. For example, in scheduling jobs (some of which could be performed at the same time), it is not good if the resulting schedule requires many jobs to occur at some specific time. An application of this type is discussed in [8]. A possible formalization of this restriction is the notion of equitable colour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.06.032